Adding Relevance to XML
Identifieur interne : 000D42 ( Main/Exploration ); précédent : 000D41; suivant : 000D43Adding Relevance to XML
Auteurs : Anja Theobald [Allemagne] ; Gerhard Weikum [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2001.
English descriptors
- Teeft :
- Arbitrary string, Automaton, Baritone saxophone, Bass saxophone, Bibliographic data, Binary operator, Boolean retrieval, Broader terms, Concatenated path, Current leaf, Data graph, Database, Dewey redman, Document collection, Element attributes, Element contents, Element name, Element names, Element variables, Elementary condition, Elementary conditions, Elementary similarity comparisons, Entire paths, Example scenario, Finite state automata, Finite state automaton, First case, First state, Future work, Greedy traversal, Information retrieval, Intermedia, Intermedia yields, Irrelevant documents, Keith jarrett, Kleene star, Large databases, Logical conjunction, Native intermedia, Node, Oracle, Oracle database, Oracle intermedia, Oracle8i intermedia, Other hand, Outgoing edges, Path concatenation, Path expression, Path expressions, Preliminary experiments, Priority queue, Production rules, Prototype, Prototype implementation, Query, Query graph, Query language, Query languages, Query representation, Reed instruments, Regular path expressions, Relevance, Relevance probabilities, Relevance probability, Result graph, Retrieval, Roscoe mitchell, Saxophone, Search algorithm, Search arguments, Search conditions, Search engine, Search engines, Search language, Search patterns, Search results, Second case, Semantic similarity, Semistructured data, Sigmod, Sigmod record, Similarity, Similarity comparisons, Similarity conditions, Similarity operator, Similarity score, Similarity scores, Similarity search, Soprano saxophone, Subgraph, Subgraphs, Tenor saxophone, Terminal symbols, Text data, Text retrieval system, Text search engine, Theobald, Thesaurus, Thesaurus lookup, Traversal, Unary operator, Weikum.
Abstract
Abstract: XML query languages proposed so far are limited to Boolean retrieval in the sense that query results are sets of qualifying XML elements or subgraphs. This search paradigm is intriguing for “closed” collections of XML documents such as e-commerce catalogs, but we argue that it is inadequate for searching the Web where we would prefer ranked lists of results based on relevance estimation. IR-style Web search engines, on the other hand, are incapable of exploiting the additional information made explicit in the structure, element names, and attributes of XML documents. In this paper we present a compact query language, coined XXL for “flexible XML search language”, that reconciles both search paradigms by combining XML graph pattern matching with relevance estimations and producing ranked lists of XML subgraphs as search results. The paper describes the language design, sketches implementation issues, and presents preliminary experimental results.
Url:
DOI: 10.1007/3-540-45271-0_7
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001785
- to stream Istex, to step Curation: 001676
- to stream Istex, to step Checkpoint: 000B33
- to stream Main, to step Merge: 000D43
- to stream Main, to step Curation: 000D42
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Adding Relevance to XML</title><author><name sortKey="Theobald, Anja" sort="Theobald, Anja" uniqKey="Theobald A" first="Anja" last="Theobald">Anja Theobald</name></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E572A0466DEB0CCADDDDE876216E5668A52FA69F</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1007/3-540-45271-0_7</idno><idno type="url">https://api.istex.fr/document/E572A0466DEB0CCADDDDE876216E5668A52FA69F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001785</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001785</idno><idno type="wicri:Area/Istex/Curation">001676</idno><idno type="wicri:Area/Istex/Checkpoint">000B33</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000B33</idno><idno type="wicri:doubleKey">0302-9743:2001:Theobald A:adding:relevance:to</idno><idno type="wicri:Area/Main/Merge">000D43</idno><idno type="wicri:Area/Main/Curation">000D42</idno><idno type="wicri:Area/Main/Exploration">000D42</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Adding Relevance to XML</title><author><name sortKey="Theobald, Anja" sort="Theobald, Anja" uniqKey="Theobald A" first="Anja" last="Theobald">Anja Theobald</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Computer Science, University of the Saarland</wicri:regionArea><wicri:noRegion>University of the Saarland</wicri:noRegion><wicri:noRegion>University of the Saarland</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Computer Science, University of the Saarland</wicri:regionArea><wicri:noRegion>University of the Saarland</wicri:noRegion><wicri:noRegion>University of the Saarland</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2001</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Arbitrary string</term><term>Automaton</term><term>Baritone saxophone</term><term>Bass saxophone</term><term>Bibliographic data</term><term>Binary operator</term><term>Boolean retrieval</term><term>Broader terms</term><term>Concatenated path</term><term>Current leaf</term><term>Data graph</term><term>Database</term><term>Dewey redman</term><term>Document collection</term><term>Element attributes</term><term>Element contents</term><term>Element name</term><term>Element names</term><term>Element variables</term><term>Elementary condition</term><term>Elementary conditions</term><term>Elementary similarity comparisons</term><term>Entire paths</term><term>Example scenario</term><term>Finite state automata</term><term>Finite state automaton</term><term>First case</term><term>First state</term><term>Future work</term><term>Greedy traversal</term><term>Information retrieval</term><term>Intermedia</term><term>Intermedia yields</term><term>Irrelevant documents</term><term>Keith jarrett</term><term>Kleene star</term><term>Large databases</term><term>Logical conjunction</term><term>Native intermedia</term><term>Node</term><term>Oracle</term><term>Oracle database</term><term>Oracle intermedia</term><term>Oracle8i intermedia</term><term>Other hand</term><term>Outgoing edges</term><term>Path concatenation</term><term>Path expression</term><term>Path expressions</term><term>Preliminary experiments</term><term>Priority queue</term><term>Production rules</term><term>Prototype</term><term>Prototype implementation</term><term>Query</term><term>Query graph</term><term>Query language</term><term>Query languages</term><term>Query representation</term><term>Reed instruments</term><term>Regular path expressions</term><term>Relevance</term><term>Relevance probabilities</term><term>Relevance probability</term><term>Result graph</term><term>Retrieval</term><term>Roscoe mitchell</term><term>Saxophone</term><term>Search algorithm</term><term>Search arguments</term><term>Search conditions</term><term>Search engine</term><term>Search engines</term><term>Search language</term><term>Search patterns</term><term>Search results</term><term>Second case</term><term>Semantic similarity</term><term>Semistructured data</term><term>Sigmod</term><term>Sigmod record</term><term>Similarity</term><term>Similarity comparisons</term><term>Similarity conditions</term><term>Similarity operator</term><term>Similarity score</term><term>Similarity scores</term><term>Similarity search</term><term>Soprano saxophone</term><term>Subgraph</term><term>Subgraphs</term><term>Tenor saxophone</term><term>Terminal symbols</term><term>Text data</term><term>Text retrieval system</term><term>Text search engine</term><term>Theobald</term><term>Thesaurus</term><term>Thesaurus lookup</term><term>Traversal</term><term>Unary operator</term><term>Weikum</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: XML query languages proposed so far are limited to Boolean retrieval in the sense that query results are sets of qualifying XML elements or subgraphs. This search paradigm is intriguing for “closed” collections of XML documents such as e-commerce catalogs, but we argue that it is inadequate for searching the Web where we would prefer ranked lists of results based on relevance estimation. IR-style Web search engines, on the other hand, are incapable of exploiting the additional information made explicit in the structure, element names, and attributes of XML documents. In this paper we present a compact query language, coined XXL for “flexible XML search language”, that reconciles both search paradigms by combining XML graph pattern matching with relevance estimations and producing ranked lists of XML subgraphs as search results. The paper describes the language design, sketches implementation issues, and presents preliminary experimental results.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Theobald, Anja" sort="Theobald, Anja" uniqKey="Theobald A" first="Anja" last="Theobald">Anja Theobald</name></noRegion><name sortKey="Theobald, Anja" sort="Theobald, Anja" uniqKey="Theobald A" first="Anja" last="Theobald">Anja Theobald</name><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D42 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000D42 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:E572A0466DEB0CCADDDDE876216E5668A52FA69F
|texte= Adding Relevance to XML
}}
| This area was generated with Dilib version V0.6.33. |  |